Toy(FD): Sketch of Operational Semantics
نویسندگان
چکیده
In [2] we proposed the integration of finite domain (FD) constraints into the functional logic programming language TOYand, as result, presented the language TOY(FD) . We showed that TOY(FD) integrates the best features of existing functional and logic languages into FD constraint solving. This paper describes a sketch (due to space limitations) of the TOY(FD) operational semantics that consists of a novel combination of lazy evaluation and FD constraint solving.
منابع مشابه
Bialgebras for structural operational semantics: An introduction
Bialgebras and distributive laws are an abstract, categorical framework to study various flavors of Structural Operational Semantics. This papers aims to introduce the reader to the basics of bialgebras for operational semantics, and to sketch the state of the art in this research area.
متن کاملOperational semantics of logical concurrent systems
We describe the operational semantics of the language for modelling logical concurrent systems (LCS). Such systems are characterised by atomic synchronous uniication. The model permits the description of both dependant and independent simultaneous actions or sets of atomic events. A semantics is given via labelled transition systems. The notion of equivalence over such systems is deened by stro...
متن کاملConstraint functional logic programming over finite domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP (FD) ) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP (FD) ) by combining functional and relational notation, curried ...
متن کاملProgramming with TOY(FD)
In [1] we presented the language T OY(FD) that integrates the best features of existing functional and logic languages, as well as finite domain (FD) constraint solving. We believe that T OY(FD) is more flexible and expressive than the existing approaches of constraint logic programming on finite domain (CLP (FD) ) as it integrates FD constraint solving, lazy evaluation, higher order applicatio...
متن کاملModel Extraction for Sockets-based Distributed Programs
The following short report introduces an approach to utilize unbounded, reliable fifo queues as basis for an operational semantics of distributed applications whose implementation is based on the Berkeley Sockets Api. After a sketch of Tcp and the Sockets Api, a first draft of a formalization of distributed programs is given as well as a straight-forward translation into the abstract formal mod...
متن کامل